Discrete homing problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Internet Multi-Homing Problems: Explanations from Economics

Companies seeking to ensure that their Internet connection is resilient often purchase services from multiple providers. This leads them inexorably towards having their IP address range visible in the global routing table, increasing the resource usage of every Internet router. Since this is essentially ‘free’, yet impacts the cost and stability of every router in the world, this is a classic ‘...

متن کامل

Evidence for discrete landmark use by pigeons during homing.

Considerable efforts have been made to investigate how homing pigeons (Columba livia f. domestica) are able to return to their loft from distant, unfamiliar sites while the mechanisms underlying navigation in familiar territory have received less attention. With the recent advent of global positioning system (GPS) data loggers small enough to be carried by pigeons, the role of visual environmen...

متن کامل

Discrete cooperative covering problems

A family of discrete cooperative covering problems is analysed in this paper. Each facility emits a signal that decays by the distance and each demand point observes the total signal emitted by all facilities. A demand point is covered if its cumulative signal exceeds a given threshold. We wish to maximize coverage by selecting locations for p facilities from a given set of potential sites. Two...

متن کامل

Discrete Boundary-value Problems

We consider multivariate sequences, deened by a partial linear recurrence equation together with appropriate boundary conditions. The domain of deenition of these sequences is the rst orthant of the integer lattice, restricted in some dimensions to an initial segment of the nonnegative integers. By means of the kernel method we obtain an explicit expression for the generating function of the so...

متن کامل

Discrete Radar Ambiguity Problems

In this paper, we pursue the study of the radar ambiguity problem started in [Ja, GJP]. More precisely, for a given function u we ask for all functions v (called ambiguity partners) such that the ambiguity functions of u and v have same modulus. In some cases, v may be given by some elementary transformation of u and is then called a trivial partner of u otherwise we call it a strange partner. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Archives of Control Sciences

سال: 2013

ISSN: 1230-2384

DOI: 10.2478/v10170-011-0039-6